Legislation-driven development of a Gift Aid system using Event-B
نویسندگان
چکیده
منابع مشابه
Event-driven and Attribute-driven Robustness
Over five decades have passed since the first wave of robust optimization studies conducted by Soyster and Falk. It is outstanding that real-life applications of robust optimization are still swept aside; there is much more potential for investigating the exact nature of uncertainties to obtain intelligent robust models. For this purpose, in this study, we investigate a more refined description...
متن کاملEvent-Driven System Requirements
In this paper, we demonstrate how model checking can be used to verify safety properties for event-driven systems. SCR tabular requirements describe required system behavior in a format that is intuitive, easy to read, and scalable to large systems (e.g., the software requhements for the A7 aircraft). Model checking of temporal logics has been established as a sound technique for verifying prop...
متن کاملEvent-Driven Embedded System Synthesis
One can argue that hardware design is fast disappearing into the ether of software, especially for embedded systems. Complex algorithms can be synthesized directly into hardware by designers who are ignorant of many of the tradeoffs being made right under their nose. Application-specific engines are synthesized in custom programmable logic and interfaced to embedded soft and hard IP cores in da...
متن کاملthe effect of using visual aids on the development of speech act of disagreement among iranian intermediate efl learners
abstract the present study tried to investigate the effect of visual aids (films) on the development of the speech act of disagreement among iranian efl intermediate learners. to this end, the researcher selected 40 homogeneous intermediate learners based on their scores on oxford placement test. .the subjects then divided into control group and experimental group. both classes were tested by ...
Efficient Graph Rewriting System Using Local Event-driven Pattern Matching
Pattern matching is the most time-cost expensive part of the graph rewriting process. When applying a given rewriting rule, most graph rewriting systems check the entire host graph for possible matches. In our modal logic theorem prover based on graph rewriting, LoTREC, we use the events that are emitted when the applied rules change locally the host graph, in order to reduce the effect of this...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Formal Aspects of Computing
سال: 2020
ISSN: 0934-5043,1433-299X
DOI: 10.1007/s00165-020-00512-5